Extremal graphs for intersecting cliques
نویسندگان
چکیده
منابع مشابه
Extremal graphs for intersecting cliques
For any two positive integers nXrX1; the well-known Turán Theorem states that there exists a least positive integer exðn;KrÞ such that every graph with n vertices and exðn;KrÞ þ 1 edges contains a subgraph isomorphic to Kr: We determine the minimum number of edges sufficient for the existence of k cliques with r vertices each intersecting in exactly one common vertex. r 2003 Elsevier Science (U...
متن کاملExtremal Graphs for Intersecting Triangles
It is known that for a graph on n vertices bn2/4c + 1 edges is sufficient for the existence of many triangles. In this paper, we determine the minimum number of edges sufficient for the existence of k triangles intersecting in exactly one common vertex. 1 Notation With integers n ≥ p ≥ 1, we let Tn,p denote the Turán graph, i.e., the complete p-partite graph on n vertices where each partite set...
متن کاملExtremal connectivity for topological cliques in bipartite graphs
Let d(s) be the smallest number such that every graph of average degree >d(s) contains a subdivision of Ks . So far, the best known asymptotic bounds for d(s) are (1+ o(1))9s2/64 d(s) (1+ o(1))s2/2. As observed by Łuczak, the lower bound is obtained by considering bipartite random graphs. Since with high probability the connectivity of these random graphs is about the same as their average degr...
متن کاملCo-cliques and star complements in extremal strongly regular graphs
Suppose that the positive integerμ is the eigenvalue of largest multiplicity in an extremal strongly regular graph G. By interlacing, the independence number of G is at most 4μ2 + 4μ− 2. Star complements are used to show that if this bound is attained then either (a) μ = 1 and G is the Schläfli graph or (b) μ = 2 and G is the McLaughlin graph. © 2006 Elsevier Inc. All rights reserved. AMS class...
متن کاملExtremal Graph for Intersecting Odd Cycles
An extremal graph for a graph H on n vertices is a graph on n vertices with maximum number of edges that does not contain H as a subgraph. Let Tn,r be the Turán graph, which is the complete r-partite graph on n vertices with part sizes that differ by at most one. The well-known Turán Theorem states that Tn,r is the only extremal graph for complete graph Kr+1. Erdős et al. (1995) determined the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2003
ISSN: 0095-8956
DOI: 10.1016/s0095-8956(03)00044-3